Satis ability for ATPG : Is it easy ?

نویسندگان

  • Philip Chong
  • Mukul Prasad
چکیده

It has been observed that SAT formulae derived from ATPG problems are eeciently solvable in practise. This seems counter-intuitive since SAT is known to be NP ? Complete. This work seeks to explain this paradox. We identify a certain property of circuits which facilitates eecient solution of ATPG-SAT instances arising from them. In addition, we provide both theoretical proofs and empirical evidence to argue that a large fraction of practical VLSI circuits could be expected to have the said property.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficiency and applications of SAT-based test pattern generation: complex fault models and optimisation problems

Modern technologies have enabled the semiconductor industry to enter a new era of integrated-circuit manufacturing. Modern ICs are not only smaller and signi cantly more high-performing than they used to be only a few years ago; they are also considerably more energy-e cient thanks to the use of new materials with convenient electric properties. However, the use of new materials is also making ...

متن کامل

High Time For High Level ATPG

High level ATPG does not make the test problem any easy. In fact, there are several design-flow-related complications it creates. Also, the fault models used in high level ATPG are not suitable. Gate level ATPG has dominated for over 20 years and continue to do so. And there are enough challenging unsolved problems in gate level ATPG and there is no evidence that high level ATPG provides any he...

متن کامل

Evaluating Optimised Decision Procedures for Propositional Modal K(m) Satis ability

Heavily-optimised decision procedures for propositional modal satisability are now becoming available. Two systems incorporating such procedures for modal K, Dlp and KsatC, are tested on randomly-generated CNF formulae with several sets of parameters, varying the maximum modal depth and ratio of propositional variable to modal subformulae. The results show some easy-hard-easy behaviour, but the...

متن کامل

Arbitrary Defects; Modeling and Applications Arbitrary Defects; Modeling and Applications

OF THE THESIS Arbitrary Defects; Modeling and Applications by Ankur Jain Thesis Director: Dr. Michael Hsiao Grading the true quality of a test set for arbitrary defects, improvement of accuracy of error and fault diagnosis, Boolean comparison for design veri cation in the presence of unknown or uninterpreted functions and automatic test pattern generation (ATPG) for intellectual property (IP) b...

متن کامل

2 . 1 Why is ATPG easy ?

Empirical observation shows that practically encountered instances of ATP6 are efficiently solvable. However, it has been known for more than two decades that ATPG is an NP-complete problem. This work is one of the first attempts to reconcile these seemingly disparate results. We introduce the concept of circuit cut-width and characterize the complexity of ATPG in terms of this property. We pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998